Symmetric polyomino tilings, tribones, ideals, and Gröbner bases
نویسندگان
چکیده
منابع مشابه
GRÖBNER BASES AND DETERMINANTAL IDEALS -- An Introduction
We give an introduction to the theory of determinantal ideals and rings, their Gröbner bases, initial ideals and algebras, respectively. The approach is based on the straightening law and the Knuth-Robinson-Schensted correspondence. The article contains a section treating the basic results about the passage to initial ideals and algebras. Let K be a field and X an m × n matrix of indeterminates...
متن کاملBinomial Edge Ideals with Quadratic Gröbner Bases
We prove that a binomial edge ideal of a graph G has a quadratic Gröbner basis with respect to some term order if and only if the graph G is closed with respect to a given labelling of the vertices. We also state some criteria for the closedness of a graph G that do not depend on the labelling of its vertex set.
متن کاملGröbner bases of ideals invariant under endomorphisms
We introduce the notion of Gröbner S-basis of an ideal of the free associative algebra K〈X〉 over a field K invariant under the action of a semigroup S of endomorphisms of the algebra. We calculate the Gröbner S-bases of the ideal corresponding to the universal enveloping algebra of the free nilpotent of class 2 Lie algebra and of the T-ideal generated by the polynomial identity [x, y, z] = 0, w...
متن کاملCombinatorially Regular Polyomino Tilings
Let T be a regular tiling of R which has the origin 0 as a vertex, and suppose that φ : R → R is a homeomorphism such that i) φ(0) = 0, ii) the image under φ of each tile of T is a union of tiles of T , and iii) the images under φ of any two tiles of T are equivalent by an orientation-preserving isometry which takes vertices to vertices. It is proved here that there is a subset Λ of the vertice...
متن کاملIdeals and graphs, Gröbner bases and decision procedures in graphs
The well known correspondence between even cycles of an undirected graph and polynomials in a binomial ideal associated to a graph is extended to odd cycles and polynomials in another binomial ideal. Other binomial ideals associated to an undirected graph are also introduced. The results about them with topics on monomial ideals are used in order to show decision procedures for bipartite graphs...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Publications de l'Institut Mathematique
سال: 2015
ISSN: 0350-1302,1820-7405
DOI: 10.2298/pim1512001m